翻訳と辞書 |
Edge cycle cover : ウィキペディア英語版 | Edge cycle cover In mathematics, an edge cycle cover (sometimes called simply cycle cover〔Cun-Quan Zhang, Integer flows and cycle covers of graphs, Marcel Dekker,1997.〕) of a graph is a set of cycles which are subgraphs of ''G'' and contain all edges of ''G''. If the cycles of the cover have no vertices in common, the cover is called vertex-disjoint or sometimes simply disjoint cycle cover. In this case the set of the cycles constitutes a spanning subgraph of ''G''. If the cycles of the cover have no edges in common, the cover is called edge-disjoint or simply disjoint cycle cover. ==Properties and applications==
抄文引用元・出典: フリー百科事典『 ウィキペディア(Wikipedia)』 ■ウィキペディアで「Edge cycle cover」の詳細全文を読む
スポンサード リンク
翻訳と辞書 : 翻訳のためのインターネットリソース |
Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.
|
|